Bounding Data with a Piecewise Linear Band

نویسنده

  • Allan R. Willms
چکیده

This paper presents an algorithm for finding a piecewise linear band which bounds given two-dimensional data. The band is of constant height, and the distance between adjacent slope discontinuities in opposite directions is restricted by two user-specified parameters.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Network Optimization with Concave Costs

In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.

متن کامل

Network Optimization with Concave Costs

In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.

متن کامل

On Passive Quadrupedal Bounding with Flexible Linear Torso

This paper studies the effect of flexible linear torso on the dynamics of passive quadruped bounding. A reduced-order passive and conservative model with linear flexible torso and springy legs is introduced. The model features extensive spine deformation during high-speed bounding, resembling those observed in a cheetah. Fixed points corresponding to cyclic bounding motions are found and calcul...

متن کامل

Physical Optics Calculation of Electromagnetic Scattering From Haack Series Nose Cone

In this paper, the physical optics method is used to study the problem of electromagnetic scattering from Haack series nose cone. First, a meshing scheme is introduced which approximates the curvature of the surface by piecewise linear functions in both axial and rotational directions. This results in planar quadrilateral patches and enables efficient determination of the illuminated region and...

متن کامل

Approximate Solution of Sensitivity Matrix of Required Velocity Using Piecewise Linear Gravity Assumption

In this paper, an approximate solution of sensitivity matrix of required velocity with final velocity constraint is derived using a piecewise linear gravity assumption. The total flight time is also fixed for the problem. Simulation results show the accuracy of the method. Increasing the midway points for linearization, increases the accuracy of the solution, which this, in turn, depends on the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2009